Parallel Algorithms for Dandelion-Like Codes
نویسندگان
چکیده
We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels. In the literature it is possible to find optimal sequential algorithms for codes belonging to this class, but, for the best of our knowledge, no parallel algorithm is reported. In this paper we present the first encoding and decoding parallel algorithms for Dandelion-like codes. Namely, we design a unique encoding algorithm and a unique decoding algorithm that, properly parametrized, can be used for all Dandelion-like codes. These algorithms are optimal in the sequential setting. The encoding algorithm implementation on an EREWPRAM is optimal, while the efficient implementation of the decoding algorithm requires concurrent reading.
منابع مشابه
Unified parallel encoding and decoding algorithms for Dandelion-like codes
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, whi...
متن کاملLinear-time Algorithms for Encoding Trees as Sequences of Node Labels
In this paper we present O(n)-time algorithms for encoding/decoding n-node labeled trees as sequences of n−2 node labels. All known encodings of this type are covered, including Prüfer-like codes and the three codes proposed by Picciotto the happy, blob, and dandelion codes. The algorithms for Picciotto’s codes are of special significance as previous publications describe suboptimal approaches ...
متن کاملDetecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach
This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملParallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees
In 1918 Prüfer showed a one-to-one correspondence between labeled trees on n nodes and sequences of (n 2) node labels, obtained by iteratively deleting the leaf with the smallest label in the current tree and appending the label of the adjacent node to the code. In 1953 Neville proposed two additional methods for encoding a labeled tree of order n into a sequence of (n 2) labels. Recently, yet ...
متن کامل